Software Model Checking for People Who Love Automata
نویسندگان
چکیده
In this expository paper, we use automata for software model checking in a new way. The starting point is to fix the alphabet: the set of statements of the given program. We show how automata over the alphabet of statements can help to decompose the main problem in software model checking, which is to find the right abstraction of a program for a given correctness property.
منابع مشابه
Assume-Guarantee Verification for Interface Automata
Interface automata provide a formalism capturing the high level interactions between software components. Checking compatibility, and other safety properties, in an automata-based system suffers from the scalability issues inherent in exhaustive techniques such as model checking. This work develops a theoretical framework and automated algorithms for modular verification of interface automata. ...
متن کاملLogics and Automata for Software Model - Checking 1
While model-checking of pushdown models is by now an established technique in software verification, temporal logics and automata traditionally used in this area are unattractive on two counts. First, logics and automata traditionally used in model-checking cannot express requirements such as pre/post-conditions that are basic to software analysis. Second, unlike in the finite-state world, wher...
متن کاملLinear weak alternating automata and the model checking problem
Abstract. Automata-based model checking is a widely used approach towards software model checking. Traditionally, nondeterministic Büchi automata are used to represent the temporal logic property to be checked. We take a look at a special kind of alternating automata, the linear weak alternating automata. They can be constructed from LTL formula in an elegant way in linear time. The emptiness c...
متن کاملA Formal Object-Oriented Analysis for Software Reliability: Design for Verification
This paper and a companion paper [32] together define, present and apply a methodology for integration of formal verification by automata-based model-checking into a commercially supported object-oriented software development process. This paper defines and illustrates a set of design rules for OOA models with executable semantics, which lead to automata models with tractable state spaces. The ...
متن کاملTimed Automata Model of Preemptive Multitasking Applications
The aim of this article is to show, how a multitasking application running under a real-time operating system compliant with the OSEK/VDX standard can be modeled by timed automata. The application under consideration consists of several tasks, it includes resource sharing and synchronization by events. For such system, model-checking theory based on timed automata and implemented in model-check...
متن کامل